منابع مشابه
Testing hypergraph colorability
We study the problem of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain property or is “far away” from the property. We prove that the fundamental problem of -colorability of k-uniform hypergraphs can be tested in time independent of the size of the hypergraph.We present a testing algorithm that examines onl...
متن کاملTesting k-colorability
Let G be a graph on n vertices and suppose that at least n edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on ck ln k/ 2 vertices are not k-colorable, where c > 0 is an absolute constant. If G is as above for k = 2, then most induced subgraphs on (ln(1/ )) b are non-bipartite, for some absolute positive constant b, and this is t...
متن کاملTesting Hypergraph Coloring
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain property or is “far away” from the property. We prove that the fundamental problem of `-colorability of k-uniform hypergraphs can be tested in time independent of the size of the hypergraph. We present a testing algorithm ...
متن کاملA note on the colorability of mixed hypergraph using k colors
The colorability problem on mixed hypergraphs is discussed. A criterion of colorability of mixed hypergraph with k colors is given.
متن کاملComparing the strength of query types in property testing: the case of testing k-colorability
We study the power of four query models in the context of property testing in general graphs, where our main case study is the problem of testing k-colorability. Two query types, which have been studied extensively in the past, are pair queries and neighbor queries . The former corresponds to asking whether there is an edge between any particular pair of vertices, and the latter to asking for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.09.031